Chebyshev Polynomial and Other New Approximations to Mills' Ratio
نویسندگان
چکیده
منابع مشابه
Chebyshev polynomial approximations for some hypergeometric systems
The hypergeometric type differential equations of the second order with polynomial coefficients and their systems are considered. The realization of the Lanczos Tau Method with minimal residue is proposed for the approximate solution of the second order differential equations with polynomial coefficients. The scheme of Tau method is extended for the systems of hypergeometric type differential e...
متن کاملNumerical Approximations Using Chebyshev Polynomial Expansions
The aim of this work is to find numerical solutions for differential equations by expanding the unknown function in terms of Chebyshev polynomials and solving a system of linear equations directly for the values of the function at the extrema (or zeros) of the Chebyshev polynomial of order N . The solutions are exact at these points, apart from round-off computer errors and the convergence of o...
متن کاملError of Truncated Chebyshev Series and Other Near Minimax Polynomial Approximations
It is well known that a near minimax polynomial approximation p is obtained by truncating the Chebyshev series of a function fafter n + 1 terms. It is shown that if /'E C' " + " [-1, I], then 1I.f-pII may be expressed in terms off' " ' I) in the same manner as the error of minimax approximation. The result is extended to other types of near minimax approximation.
متن کاملNumerical approximations using Chebyshev polynomial expansions: El-gendi’s method revisited
Abstract We present numerical solutions for differential equations by expanding the unknown function in terms of Chebyshev polynomials and solving a system of linear equations directly for the values of the function at the extrema (or zeros) of the Chebyshev polynomial of order N (El-gendi’s method). The solutions are exact at these points, apart from round-off computer errors and the convergen...
متن کاملChebyshev Approximations to the Histogram χ Kernel
The random Fourier features methodology can be used to approximate the performance of kernel classifiers in linear time in the number of training examples. However, there still exists a non-trivial performance gap between the approximation and the nonlinear kernel classifiers, especially for the exponential χ kernel, one of the most powerful models for histograms. Based on analogies with Chebys...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Mathematical Statistics
سال: 1963
ISSN: 0003-4851
DOI: 10.1214/aoms/1177704012